Depth-bounded bottom-up evaluation of logic programs
نویسندگان
چکیده
منابع مشابه
Depth-Bounded Bottom-Up Evaluation of Logic Program
> We present here a depth-bounded bottom-up evaluation algorithm for logic programs. We show that it is sound, complete, and terminating for nite-answer queries if the programs are syntactically restricted to Datalog nS , a class of logic programs with limited function symbols. Datalog nS is an extension of Datalog capable of representing innnite phenomena. Predicates in Datalog nS can have arb...
متن کاملRule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
Logic programs can be evaluated bottom-up by repeatedly applying all rules, in “iterations”, until the fixpoint is reached. However, it is often desirable — and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics — to apply the rules in some order. An important property of a fixpoint evaluation algorithm is that it does not repeat inferences; we say ...
متن کاملEfficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation
B o t t o m u p evaluation of logic programs has recently at tracted much attention in the logic programming and the deductive database field. It is complete [7], and if the number of all possible facts is finite, it is guaranteed to terminate, while t op -down evaluation may not. B o t t o m u p evaluation, however, may be inefficient since it may generate many facts irrelevant to the query. T...
متن کاملA Framework for Bottom Up Specialisation of Logic Programs
In this paper, we develop a solid theoretical foundation for a bottom up program transformation, capable of specialising a logic program with respect to a set of unit clauses. Extending a well-known operator , originally introduced for composing logic programs, we deene a bottom up partial deduction operator and prove correctness of the transformation with respect to the S-semantics. We also sh...
متن کاملA New Meta-complexity Theorem for Bottom-Up Logic Programs
Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper gives a new meta-complexity theorem for bottom-up logic programs that is both more general and more accurate than previous such theorems. The new theorem applies to algorithms not handled by previous meta-complexity theorems, great...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1995
ISSN: 0743-1066
DOI: 10.1016/0743-1066(94)00030-a